k-Limited Erasing Performed by Scattered Context Grammars
نویسنده
چکیده
A scattered context grammar, G, erases nonterminals in a k-limited way, where k≥ 1, if in every sentential form of any derivation, between every two symbols from which G derives non-empty strings, there occur no more than k nonterminals from which G derives empty words. This paper demonstrates that any scattered context grammar that erases nonterminals in this way can be converted to an equivalent scattered context grammar without any erasing productions while in general, this conversion is impossible.
منابع مشابه
Accepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کاملAccepting Grammars and Systems: An Overview
We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In a lot of cases, accepting mode turns out to be exactly as powerful...
متن کاملOn the Generative Power of CD Grammar Systems With Scattered Context Components
There is a long time open problem regarding the generative power of scattered context grammars without erasing rules. This problem tries to compare their generative power with context-sensitive grammars. In this paper, modified version of this problem will be presented. This modified version combines scattered context grammars with another model — grammar systems. It will be shown that when con...
متن کاملOn Unconditional Transfer
In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed grammars, matrix grammars, grammars with regular control, grammars controlled by bicoloured digraphs, and periodically time-variant grammars , especially regarding their descriptive capacity. Moreover, we sketch the relations to restricted parallel mechanisms like k-, u...
متن کاملTwo Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars
The present paper introduces and discusses generalized scattered context grammars that are based upon sequences of productions whose left-hand sides are formed by nonterminal strings, not just single nonterminals. It places two restrictions on the derivations in these grammars. More specifically, let k be a positive integer. The first restriction requires that all rewritten symbols occur within...
متن کامل